Some New Results in the Kolmogorov-sinai Theory of Entropy and Ergodic Theory
ثبت نشده
چکیده
ergodic theory : Bernoulli shifts. There is a class of transformations that play a central role in ergodic theory, namely the Bernoulli shifts. The reason for this is partly because they are in a certain sense the simplest examples of measure-preserving transformations and partly because of their role in applications. Definition of Bernoulli shifts. If we are given positive numbers Pu ' ' ' » Pkj where 23*-i £»l> w e define the Bernoulli shift (Pu ' * • , pk) as follows: Let Y be a set with k elements and let us give 880 D. S. ORNSTEIN [November the ith element measure pi. Let Yi, — < i < + °°, be copies of F and let X be the product of the F» with the product measure. Thus each point in X is a doubly infinite sequence of points in F. T will act by shifting each of the above sequences. Tha t is, T will take the sequence {yl } into the sequence {yl } where y I ~yi+v There is a theorem that says that any invertible, ergodic, measurepreserving transformation can be obtained if we modify the above construction by taking F to be countable and by taking some other measure invariant under the shift, instead of the product measure. Thus Bernoulli shifts are simplest in the sense that the product measure is the simplest measure invariant under the shift. Let P be the partition of X into k sets which is obtained as follows : {yi} and {yl } will be in the same atoms of P if yo = yó • I t is easy to see that P , T corresponds to the process of spinning a roulette wheel with k slots of widths pi. Thus from the probability point of view Bernoulli shifts correspond to independent processes. There is a more geometric way of describing Bernoulli shifts, which goes as follows: We will start by describing the Bernoulli shift ( | , | ) . Let X be the unit square. T will send the point (x, y) into (2x, %y) if 0Sx<% and (2# — 1 , f;y+J) if | ^ x < l . We can picture T as follows: We first squeeze down the unit square and we then translate the part that has left the square back onto the part of the square that is now empty.
منابع مشابه
Observational Modeling of the Kolmogorov-Sinai Entropy
In this paper, Kolmogorov-Sinai entropy is studied using mathematical modeling of an observer $ Theta $. The relative entropy of a sub-$ sigma_Theta $-algebra having finite atoms is defined and then the ergodic properties of relative semi-dynamical systems are investigated. Also, a relative version of Kolmogorov-Sinai theorem is given. Finally, it is proved that the relative entropy of a...
متن کاملQuantum Dynamical Entropies and Gács Algorithmic Entropy
Several quantum dynamical entropies have been proposed that extend the classical Kolmogorov–Sinai (dynamical) entropy. The same scenario appears in relation to the extension of algorithmic complexity theory to the quantum realm. A theorem of Brudno establishes that the complexity per unit time step along typical trajectories of a classical ergodic system equals the KS-entropy. In the following,...
متن کاملKrieger’s Finite Generator Theorem for Actions of Countable Groups Iii
We continue the study of Rokhlin entropy, an isomorphism invariant for p.m.p. actions of countable groups introduced in Part I. In this paper we prove a non-ergodic finite generator theorem and use it to establish subadditivity and semi-continuity properties of Rokhlin entropy. We also obtain formulas for Rokhlin entropy in terms of ergodic decompositions and inverse limits. Finally, we clarify...
متن کاملA Revised Generalized Kolmogorov-Sinai-like Entropy and Markov Shifts
The Kolmogorov-Sinai entropy in the sense of Tsallis under Bernoulli shifts was obtained by Mesón and Vericat [J. Math. Phys. 37, 4480(1996)]. In this paper, we propose a revised generalized Kolmogorov-Sinai-q entropy under Markov shifts. The form of this generalized entropy with factor q is nonextensive. The new generalized entropy contains the classical Kolmogorov-Sinai entropy and Renýı entr...
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملEntropy of infinite systems and transformations
The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...
متن کامل